The expected eigenvalue distribution of a large regular graph

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Expected Eigenvalue Distribution of a Large Regular Graph

Let X,, X,,. be a sequence of regular graphs with degree ~a2 such that n(X,)cc and ck(X,)/n(X,)-0 as i -cc for each ka3, where n(X,) is the order of Xi, and ck( X,) is the number of k-cycles in Xi. We determine the limiting probability density f(x) for the eigenvalues of X, as i-cc. It turns out that i o/4(“-1)-x” f(x)= 2n(u”_x’) for IrlG2JFi, IO otherwise It is further shown that f(x) is the e...

متن کامل

Large Random Matrices: Eigenvalue Distribution

A recursive method is derived to calculate all eigenvalue correlation functions of a random hermitian matrix in the large size limit, and after smoothing of the short scale oscillations. The property that the two-point function is universal, is recovered and the three and four-point functions are given explicitly. One observes that higher order correlation functions are linear combinations of u...

متن کامل

Asymptotic eigenvalue distribution of large Toeplitz matrices

We study the asymptotic eigenvalue distribution of Toeplitz matrices generated by a singular symbol. It has been conjectured by Widom that, for a generic symbol, the eigenvalues converge to the image of the symbol. In this paper we ask how the eigenvalues converge to the image. For a given Toeplitz matrix Tn(a) of size n, we take the standard approach of looking at det(ζ − Tn(a)), of which the ...

متن کامل

Large regular graphs with given valency and second eigenvalue

From Alon and Boppana, and Serre, we know that for any given integer k ≥ 3 and real number λ < 2 √ k − 1, there are finitely many k-regular graphs whose second largest eigenvalue is at most λ. In this paper, we investigate the largest number of vertices of such graphs.

متن کامل

Eigenvalue Distribution of Large Sample Covariance Matrices of Linear Processes

We derive the distribution of the eigenvalues of a large sample covariance matrix when the data is dependent in time. More precisely, the dependence for each variable i = 1, . . . , p is modelled as a linear process (Xi,t)t=1,...,n = ( ∑∞ j=0 cjZi,t−j)t=1,...,n, where {Zi,t} are assumed to be independent random variables with finite fourth moments. If the sample size n and the number of variabl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 1981

ISSN: 0024-3795

DOI: 10.1016/0024-3795(81)90150-6